Gram : A Graph Data Model and Query Language 1
نویسندگان
چکیده
Bernd Amann INRIA F-78153 Le Chesnay Cedex, France Michel Scholl Cedric/CNAM 292 rue St Martin, F-75141 Paris Cedex 03, France Abstract We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language based on these regular expressions and supporting a restricted form of recursion is introduced. A natural application of this model and its query language is hypertext querying.
منابع مشابه
انتخاب مناسبترین زبان پرسوجو برای استفاده از فراپیوندها جهت استخراج دادهها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES
Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...
متن کاملDatabase Query Formation from Natural Language using Semantic Modeling and Statistical Keyword Meaning Disambiguation
This paper describes a natural language interface to database systems which is based on the query formation capabilities of a High-level Query Formulator. The formulator relies on the Semantic Graph of the database, which is a model of the data stored in the database. The natural language interface accepts a user input in natural language and extracts the necessary information needed by the for...
متن کاملChoosing a Data Model and Query Language for Provenance
The ancestry relationships found in provenance form a directed graph. Many provenance queries require traversal of this graph. The data and query models for provenance should directly and naturally address this graph-centric nature of provenance. To that end, we set out the requirements for a provenance data and query model and discuss why the common solutions (relational, XML, RDF) fall short....
متن کاملDependence Language Model for Information Retrieval1
This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing the independence assumption. We integrate the linkage of a query as a hidden variable, which expresses the term dependencies within the query as an acyclic, planar, undirected graph. We then assume that a query is genera...
متن کاملMUDOS-NG: Multi-document Summaries Using N-gram Graphs (Tech Report)
This report describes the MUDOS-NG summarization system, which applies a set of language-independent and generic methods for generating extractive summaries. The proposed methods are mostly combinations of simple operators on a generic character n-gram graph representation of texts. This work defines the set of used operators upon n-gram graphs and proposes using these operators within the mult...
متن کامل